Zero-one programming using non-binary tree-search
نویسندگان
چکیده
منابع مشابه
Solving zero-one mixed integer programming problems using tabu search
We describe a tabu search (TS) approach for solving general zero-one mixed integer programming (MIP) problems that exploits the extreme point property of zero-one solutions. Specialized choice rules and aspiration criteria are identified for the problems, expressed as functions of integer infeasibility measures and objective function values. The first-level TS mechanisms are then extended with ...
متن کاملConnecting Yule Process, Bisection and Binary Search Tree via Martingales
We present new links between some remarkable martingales found in the study of the Binary Search Tree or of the bisection problem, looking at them on the probability space of a continuous time binary branching process.
متن کاملNearest Neighbor Search Using Additive Binary Tree
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consuming if computed feature by feature for all templates in the reference set; this naı̈ve method is O(nd) where n is the number of templates in the reference set and d is the number of features or dimension. For this reaso...
متن کاملDesigning Optimal Binary Search Tree Using Parallel Genetic Algorithms
Evolutionary algorithms (EAs) are modern techniques for searching complex spaces for on optimum [11]. Genetic algorithms (GAs) are developed as random search methods, which have not so sensitivity on primary data of the problems. They can be used in estimation of system parameters in order to obtain the best result. This can be achieved by optimization of an objective function. Genetic programm...
متن کاملTeaching Binary Tree Algorithms through Visual Programming
In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating abstract tree fragments (not necessarily just single nodes) in a visual way. This work contributes to visual programming research by combining elements of animation, programming, and proof to produce an educational visual prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1971
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/14.4.418